Key storage in secure networks

In this paper the key storage problem associated with the provision of secure communications between every pair of users in a large network is described, and a possible method of alleviating the problem is discussed. This method, based on the use of finite incidence structures with special properties called key distribution patterns, is shown to generalize earlier work in the area. The more general formulation of the storage saving scheme contained here enables use to be made of the extensive body of knowledge already existing on the theory of block designs. From this theory we are able to extract a number of new families of examples of potentially useful key distribution systems.